The idle period of the finite G/M/1 queue with an interpretation in risk theory

نویسندگان

  • Andreas Löpker
  • David Perry
چکیده

We consider a G/M/1 queue with restricted accessibility in the sense that the maximal workload is bounded by 1. If the current workload Vt of the queue plus the service time of an arriving customer exceeds 1, only 1 − Vt of the service requirement is accepted. We are interested in the distribution of the idle period, which can be interpreted as the deficit at ruin for a risk reserve process Rt in the compound Poisson risk model. For this risk process a special dividend strategy applies, where the insurance company pays out all the income whenever Rt reaches level 1. In the queueing context we further introduce a set-up time a ∈ [0,1]. At the end of every idle period, an arriving customer has to wait for a time units until the server is ready to serve it.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Working Vacation Queue with Second Optional Service and Unreliable Server

An M/M/1 queueing system with second optional service and unreliable server is studied. We consider that the server works at different rate rather than being idle during the vacation period. The customers arrive to the system according to Poisson process with state dependent rates depending upon the server’s status. All customers demand the first essential service whereas only some of them dema...

متن کامل

M M m K Queue With Additional Servers and Discouragement (RESEARCH NOTE)

Waiting in long queue is undesirable due to which in some practical situations customers become impatient and leave the system. In such cases providing additional servers can reduce long queue. This investigation deals with multi-server queueing system with additional servers and discouragement. The customers arrive in poisson fashion and are served exponentially by a pool of permanent and addi...

متن کامل

Maximum Entropy Analysis for G/G/1 Queuing System (TECHNICAL NOTE)

This paper provides steady state queue-size distribution for a G/G/1 queue by using principle of maximum entropy. For this purpose we have used average queue length and normalizing condition as constraints to derive queue-size distribution. Our results give good approximation as demonstrated by taking a numerical illustration. In particular case when square coefficient of variation of inter-arr...

متن کامل

Analysis of a finite MAP/G/1 queue with group services

The finite capacity queues, G I / P H / 1 / N and PH/G/1 /N, in which customers are served in groups of varying sizes were recently introduced and studied in detail by the author. In this paper we consider a finite capacity queue in which arrivals are governed by a particular Markov renewal process, called a Markovian arrival process (MAP). With general service times and with the same type of s...

متن کامل

Analyses of a Markovian queue with two heterogeneous servers and working vacation

This paper analyzes an M/M/2 queueing system with two heterogeneous servers. Both servers goes on vacation when there is no customers waiting for service after this server 1 is always available but the other goes on vacation whenever server 2 is idle. The vacationing server however, returns to serve at a low rate as an arrival finds the other server busy. The system is analyzed in the steady st...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Queueing Syst.

دوره 64  شماره 

صفحات  -

تاریخ انتشار 2010